منابع مشابه
Competing Matchmaking
We study how competing matchmakers use prices to sort participants into search markets, where they form random pairwise matches, and how equilibrium outcomes compare with monopoly in terms of prices, search market structure and sorting efficiency. The role of prices to facilitate sorting is compromised by the need to survive price competition. We show that the competitive outcome can be less ef...
متن کاملOntological Matchmaking in Recommender Systems
The electronic marketplace offers great potential for the recommendation of supplies. In the so called recommender systems, it is crucial to apply matchmaking strategies that faithfully satisfy the predicates specified in the demand, and take into account as much as possible the user preferences. We focus on real-life ontology-driven matchmaking scenarios and identify a number of challenges, be...
متن کاملKnowledge Representation in Matchmaking Applications
The features and success of matchmaking systems largely depend on how effectively participants' product/service descriptions (profile) are modelled. We formalize the multifaceted expectations and interests of participants as ‘constraints’ in those profiles. We identify and define the relevant types of constraints and explicitly document challenges in matchmaking. A Knowledge Representation Mode...
متن کاملSemantic matchmaking of grid services using parameter matchmaking algorithm
The main objective of this research work is to extend the capability of Globus Toolkit (GT) to support semantic description and discovery of Grid Services. We proposed Protégé Enabled Globus toolkit(PEG) )in which we have integrated GT with Protégé editor to support globus user for semantic descriptions of Grid services and the Algernon inference engine is used to interact with the OWLS descrip...
متن کاملLocal Distributed Agent Matchmaking
This paper explores through simulation an abstract model of distributed matchmaking within multi-agent systems. We show that under certain conditions agents can find matches for cooperative tasks without the help of a predefined organization or central facilitator. We achieve this by having each agent search for partners among a small changing set of neighbors. We work with a system where agent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Biotechnology
سال: 1999
ISSN: 1087-0156,1546-1696
DOI: 10.1038/12803